Chapter 1 SCHEDULING ALGORITHMS FOR UNICAST , MULTICAST , AND BROADCAST
نویسنده
چکیده
In this chapter we present a survey of algorithms for scheduling packet traffic in broadcast optical WDM networks. We first describe the context and motivations of the scheduling problem. We then review the current literature in the field with an emphasis on scheduling techniques for providing best-effort service as well as guaranteed service for both unicast and multi-destination traffic. We provide alternative formulations of the problem, and we compare the formulations and theoretical results, as well as algorithms and heuristics.
منابع مشابه
Scheduling Combined Unicast and Multicast Tra c in Broadcast WDM Networks
This paper studies the performance of various strategies for scheduling a combined load of unicast and multicast traac in a broadcast WDM network. The performance measure of interest is schedule length, which directly aaects both aggregate network throughput and average packet delay. Three diierent scheduling strategies are presented, namely: separate scheduling of uni-cast and multicast traac,...
متن کاملJoint Multicast/Unicast Scheduling with Dynamic Optimization for LTE Multicast Service
Mobile video service is one of the most increasing uses expected in future generation cellular networks, including multicast video services. Based upon Evolved Multimedia Broadcast and Multicast Service (eMBMS) available with 3rd Generation Partnership Project (3GPP) release 9, Long Term Evolution (LTE) can provide broadcast/multicast content delivery with a single-frequency network mode. This ...
متن کاملScheduling Combined Unicast and Multicast Tra c in WDM Networks
We study the performance of various strategies for scheduling a combined load of unicast and multicast tra c in a broadcast WDM network. The performance measure of interest is schedule length, which directly a ects both aggregate network throughput and average packet delay. Three di erent scheduling strategies are presented, namely: separate scheduling of unicast and multicast tra c, treating m...
متن کاملMulticast Pull Scheduling : When Fairness is
We investigate server scheduling policies to minimize average user perceived latency in pull-based client-server systems (systems where multiple clients request data from a server) where the server answers requests on a multicast/broadcast channel. We rst show that there is no O(1)-competitive algorithm for this problem. We then give a method to convert any nonclairvoyant unicast scheduling alg...
متن کاملMulticast scheduling with resource fairness constraints
Integration of multicast and unicast data in future radio access networks will be necessary in order to improve the resource efficiency and provide new services. Such integration requires new and efficient resource sharing mechanisms. These mechanisms need to be optimized to provide the best possible trade-off between resource efficiency and fairness. In this paper, we consider a case where str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000